Higher Dimensional Discrete Cheeger Inequalities
نویسندگان
چکیده
4 For graphs there exists a strong connection between spectral and combinatorial 5 expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the 6 lower bound of which states that λ(G) ≤ h(G), where λ(G) is the second smallest 7 eigenvalue of the Laplacian of a graph G and h(G) is the Cheeger constant measuring 8 the edge expansion of G. We are interested in generalizations of expansion properties 9 to finite simplicial complexes of higher dimension (or uniform hypergraphs). 10 Whereas higher dimensional Laplacians were introduced already in 1945 by Eck11 mann, the generalization of edge expansion to simplicial complexes is not straight12 forward. Recently, a topologically motivated notion analogous to edge expansion 13 that is based on Z2-cohomology was introduced by Gromov and independently by 14 Linial, Meshulam and Wallach and by Newman and Rabinovich. It is known that 15 for this generalization there is no higher dimensional analogue of the lower bound 16 of the Cheeger inequality. A different, combinatorially motivated generalization of 17 the Cheeger constant, denoted by h(X), was studied by Parzanchevski, Rosenthal 18 and Tessler. They showed that indeed λ(X) ≤ h(X), where λ(X) is the smallest 19 non-trivial eigenvalue of the ((k − 1)-dimensional upper) Laplacian, for the case of 20 k-dimensional simplicial complexes X with complete (k − 1)-skeleton. 21 Whether this inequality also holds for k-dimensional complexes with non-complete 22 (k − 1)-skeleton has been an open question. We give two proofs of the inequality 23 for arbitrary complexes. The proofs differ strongly in the methods and structures 24 employed, and each allows for a different kind of additional strengthening of the 25 original result. 26 ∗Institut für Theoretische Informatik, ETH Zürich, CH-8092 Zürich, Switzerland. [email protected]. Research supported by the Swiss National Science Foundation (SNF Projects 200021-125309 and 200020-138230). †Institut für Theoretische Informatik, ETH Zürich, CH-8092 Zürich, Switzerland. [email protected].
منابع مشابه
Cheeger Inequalities for General Edge-Weighted Directed Graphs
We consider Cheeger Inequalities for general edge-weighted directed graphs. Previously the directed case was considered by Chung for a probability transition matrix corresponding to a strongly connected graph with weights induced by a stationary distribution. An Eulerian property of these special weights reduces these instances to the undirected case, for which recent results on multi-way spect...
متن کاملCheeger Inequalities for Submodular Transformations
The Cheeger inequality for undirected graphs, which relates the conductance of an undirected graph and the second smallest eigenvalue of its normalized Laplacian, is a cornerstone of spectral graph theory. The Cheeger inequality has been extended to directed graphs and hypergraphs using normalized Laplacians for those, that are no longer linear but piecewise linear transformations. In this pape...
متن کاملSpectral graph theory: Cheeger constants and discrepancy∗
In this third talk we will discuss properties related to edge expansion. In particular, we will define the Cheeger constant (which measures how easy it is to cut off a large piece of the graph) and state the Cheeger inequalities. We also will define and discuss discrepancy for undirected and directed graphs. We also state the Perron-Frobenius Theorem which is a useful tool in spectral graph the...
متن کاملLog-sobolev, Isoperimetry and Transport Inequalities on Graphs
In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...
متن کاملOn Cheeger-type inequalities for weighted graphs
We give several bounds on the second smallest eigenvalue of the weighted Laplacian matrix of a finite graph and on the second largest eigenvalue of its weighted adjacency matrix. We establish relations between the given Cheeger-type bounds here and the known bounds in the literature. We show that one of our bounds is the best Cheeger-type bound available.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JoCG
دوره 6 شماره
صفحات -
تاریخ انتشار 2015